Dedication: It’s all allowed: inspired by Adrian

Adrian Dumitrescu

This column is devoted to maximum (respectively, maximum weight) independent set problems in geometric intersection graphs. We illustrate with one example in each class: (I) The following question was asked by T. Rado in 1928: What is the largest number c such that, for any finite set F of axis-parallel squares in the plane, there exists an independent subset I ⊆ F of pairwise disjoint squares ...

Finding All Allowed Edges in a Bipartite Graph

We consider the problem of finding all allowed edges in a bipartite graph G = (V,E), i.e., all edges that are included in some maximum matching. We show that given any maximum matching in the graph, it is possible to perform this computation in linear time O(n + m) (where n = |V | and m = |E|). Hence, the time complexity of finding all allowed edges reduces to that of finding a single maximum m...

CoVaR By Tobias Adrian and Markus

We propose a measure of systemic risk, ∆CoVaR, defined as the change in the value at risk of the financial system conditional on an institution being under distress relative to its median state. Our estimates show that characteristics such as leverage, size, maturity mismatch, and asset price booms significantly predict ∆CoVaR. We also provide out-of-sample forecasts of a countercyclical, forwa...

Adrian Bird

comprised populations that differ genetically in their response to the environment at spatial scales of around 600–800 km, undetected by microsatellite DNA variations. They caught cod from four populations within the Atlantic and looked at larval growth in the laboratory. Among all four populations, growth increased with food supply and temperature but the influence of changes in food and tempe...

iii DEDICATION